Single Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
نویسندگان
چکیده مقاله:
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-destination pair within a given time bound.
منابع مشابه
Capacitated Single-Assignment Hub Covering Location Problem under Fuzzy Environment
This paper studies capacitated single-allocation hub covering location problem with fuzzy cover radius and travel time. Objective of hub covering problem is to find the minimum number of hubs considering the maximum allowable travel time. Computational results show that due to uncertainty, number of hubs and the allocation of non-hub nodes to hub nodes are changed. This paper proposes heuristic...
متن کاملComplete / Incomplete Hierarchical Hub Center Single Assignment Network Problem
In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs. The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...
متن کاملthe capacitated hierarchical p-hub median problem considering delivery time
in this paper, a hierarchical p-hub median problem is considered that all the nodes and arcs on the network have limited capacities. proposed model has three-level where the complete network at the top level consists of the central hubs. the second and third levels consist of hub and demand nodes respectively, which are connected through star networks. also, delivery time restriction is taken i...
متن کاملcomplete / incomplete hierarchical hub center single assignment network problem
in this paper we present the problem of designing a three level hub center network. in our network, the top level consists of a complete network where a direct link is between all central hubs. the second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. we model this problem in an incomplete net...
متن کاملrobust optimization model for locating and capacitated hub covering problem
in this paper, a robust model presented is developed for hub covering flow problem in which hubs have capacity. this problem has two objective functions converting to a single-objective problem by using weighting method. firstly, the problem will be formulated in a certain case. then, by considering the demand as a non-random variable, it will be modeled by robust optimization. finally, by usin...
متن کاملCapacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 11 شماره 4
صفحات 319- 335
تاریخ انتشار 2019-12-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023